Outer Approximation Methods for Solving Variational Inequalities Defined over the Solution Set of a Split Convex Feasibility Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSelf-Adaptive and Relaxed Self-Adaptive Projection Methods for Solving the Multiple-Set Split Feasibility Problem
and Applied Analysis 3 half-spaces, so that the algorithm is implementable. We need not estimate the Lipschitz constant and make a sufficient decrease of the objection function at each iteration; besides, these projection algorithms can reduce to the modifications of the CQ algorithm 6 when the MSSFP 1.1 is reduced to the SFP. We also show convergence the algorithms under mild conditions.
متن کاملSolving asymmetric variational inequalities via convex optimization
Using duality, we reformulate the asymmetric variational inequality (VI) problem over a conic region as an optimization problem. We give sufficient conditions for the convexity of this reformulation. We thereby identify a class of VIs that includes monotone affine VIs over polyhedra, which may be solved by commercial optimization solvers. © 2005 Elsevier B.V. All rights reserved.
متن کاملRegularized Methods for the Split Feasibility Problem
and Applied Analysis 3 However, 1.8 is, in general, ill posed. So regularization is needed. We consider Tikhonov’s regularization min x∈C fα : 1 2 ∥I − PQ ) Ax ∥∥2 1 2 α‖x‖, 1.9 where α > 0 is the regularization parameter. We can compute the gradient ∇fα of fα as ∇fα ∇f x αI A∗ ( I − PQ ) A αI. 1.10 Define a Picard iterates x n 1 PC ( I − γA∗I − PQ ) A αI )) x n 1.11 Xu 20 shown that if the SFP...
متن کاملIterative Methods for Solving Trifunction Variational Inequalities
In this paper, we introduce and consider a class of variational inequalities, which is called the trifunction variational inequality. We use the auxiliary principle technique to suggest and analyze an implicit iterative methods for solving the trifunction variational inequalities. We study the convergence criteria of this new method under pseudomomotonicity condition, which is weaker condition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Functional Analysis and Optimization
سال: 2020
ISSN: 0163-0563,1532-2467
DOI: 10.1080/01630563.2020.1737938